Contemporary Mathematics Computation of Syzygies Over Non-Commutative Rings Holger Bluhm and Martin Kreuzer This paper is dedicated to Gerhard Rosenberger on occasion of his 60th birthday. Abstract. This paper is devote

Source URL: www.symbcomp.fim.uni-passau.de

• Algebra
• Abstract algebra
• Mathematics
• Algebraic geometry
• Commutative algebra
• Ring theory
• Ring
• Grbner basis

A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott Aaronson

Source URL: www.scottaaronson.com

• Mathematics
• Theoretical computer science
• Computability theory
• Mathematical logic
• Theory of computation
• Turing machine
• Models of computation
• Busy beaver
• Halting problem
• ZermeloFraenkel set theory
• Computability
• Computable function

PowerLyra: Differentiated Graph Computation and Partitioning on Skewed Graphs Rong Chen, Jiaxin Shi, Yanzhe Chen, Haibo Chen Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed

Source URL: ipads.se.sjtu.edu.cn

• Graph theory
• Vertex
• Graph
• Ear decomposition
• Distance
• Pathwidth
• Graph coloring

Fast Computation of Gauss Sums and Resolution of the Root of Unity Ambiguity Dang Khoa Nguyen Division of Mathematical Sciences School of Physical & Mathematical Sciences Nanyang Technological University

Source URL: www.ntu.edu.sg

• Polynomials
• Cyclotomic fields
• Field theory
• Algebraic numbers
• Algebraic number theory
• Gaussian period
• Quadratic Gauss sum
• Cyclotomic polynomial
• Root of unity
• Polynomial ring
• Algebraic integer
• Algebraic number field

ANNEXURE D: LIST OF REPUTED PUBLICATIONS IN CSE Acronym SIGCOMM SIGMETRICS CCS

Source URL: www.cse.iitd.ernet.in

• Theoretical computer science
• Association for Computing Machinery
• ACM SIGACT
• Computer science
• International Conference on Functional Programming
• Computational geometry
• Computational intelligence
• Computational learning theory
• International Symposium on Symbolic and Algebraic Computation
• Algorithmica
• Draft:Chittoor V. Ramamoorthy
• Vasant Honavar

Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem Alex Biryukov Dmitry Khovratovich

Source URL: www.internetsociety.org

• Computational complexity theory
• Theory of computation
• Complexity classes
• Analysis of algorithms
• Finite fields
• NP
• Spacetime tradeoff
• Algorithm
• Time complexity
• IP
• P
• XTR

Social Exchange Networks With Distant BargainingI Konstantinos Georgiou1 , George Karakostas2,∗, Jochen K¨onemann1 , Zuzanna Stamirowska3 Abstract Network bargaining is a natural extension of the classical, 2-player N

Source URL: www.cas.mcmaster.ca

• Computational complexity theory
• Game theory
• Theory of computation
• Computational problems
• Cooperative game theory
• Core
• NC
• Optimization problem

Herbrand’s theorem and extractive proof theory U. Kohlenbach Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstrasse 7, 64289 Darmstadt, Germany September 1, 2008

Source URL: www.mathematik.tu-darmstadt.de

• Mathematics
• Mathematical analysis
• Mathematical logic
• Functions and mappings
• Computability theory
• Primitive recursive function
• Recursion
• Theory of computation
• First-order logic
• Limit of a function
• Peano axioms
• Spectral theory of ordinary differential equations

Intro RAND & DNC WWKL & RWWKL

Source URL: ludovicpatey.com

• Mathematics
• Computability theory
• Theoretical computer science
• Theory of computation
• Reverse mathematics
• Computable function
• Graph coloring
• Randomness
• Rand
• RAND Corporation

University of California, Irvine Statistics Seminar Theory and Computation for Bayesian Nonparametric Estimation Problems

Source URL: www.stat.uci.edu